Peer-to-Peer Refuelling within a Satellite Constellation Part I: Zero-Cost Rendezvous Case
نویسندگان
چکیده
In this paper, we study the scheduling problem arising from refuelling multiple satellites in a constellation. The satellites in the constellation are assumed to be capable of refuelling each other. The cost of the rendezvous maneuver between two satellites exchanging fuel is assumed to be negligible. The goal of this refuelling problem is to equalize the fuel stored among all satellites in the constellation after a given period. It is shown that the problem of equalizing the fuel among the satellites can be formulated and solved as a maximum-weight matching problem.
منابع مشابه
Peer-to-Peer Refuelling within a Satellite Constellation Part II: Nonzero-Cost Rendezvous Case
In this paper, we study the scheduling problem arising from refuelling multiple satellites in a constellation. It is assumed that there is no fuel delivered to the constellation externally. Instead, the satellites in the constellation are assumed to be capable of refuelling each other. The cost of the rendezvous maneuver between two satellites conducting a fuel transfer is taken into considerat...
متن کاملPeer-to-Peer Refueling for Circular Satellite Constellations
In this paper, we study the scheduling problem arising from refueling multiple satellites in a circular constellation. It is assumed that there is no fuel delivered to the constellation from an external source. Instead, all satellites in the constellation are assumed to be capable of refueling each other (peer-to-peer refueling). The total time to complete the rendezvous maneuvers including the...
متن کاملA Cooperative P2p Refueling Strategy for Circular Satellite Constellations
In this paper, we discuss the problem of peer-to-peer (P2P) refueling of satellites in a circular constellation. In particular, we propose a cooperative P2P (C-P2P) refueling strategy, in which the satellites involved in P2P maneuvers are allowed to engage in cooperative rendezvous. We discuss a formulation of the proposed C-P2P strategy and a methodology to determine the optimal C-P2P assignme...
متن کاملEgalitarian Peer-to-Peer Satellite Refueling Strategy
bi = supply/demand corresponding to a node in Vn C M = cost of an egalitarian peer-to-peer solution M CLB = optimal value of objective function of the optimization problem cij = cost of an edge in Gn cij = cost of an edge in G‘ c i; j; k = cost of a triplet i; j; k representing an egalitarian peer-to-peer maneuver d = distance between two triplets tp and tq E‘ = set of edges in G‘ Ef = set of e...
متن کاملOptimal Scheduling for Servicing Multiple Satellites in a Circular Constellation
This paper studies the scheduling of servicing multiple satellites in a circular orbit. Specifically, one servicing spacecraft (SSc) is considered to be initially on the circular orbit of the satellites to be serviced. The SSc then rendezvous with each satellite of the constellation and services it until all satellites are visited. The total time is assumed to be given. A minimum-∆V two-impulse...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2003